SPACE - TIME PROGRAMMING 2012 Research Statement

نویسنده

  • Jonathan Bachrach
چکیده

The computational landscape is drastically changing. Processing is becoming virtually free, and sensors and actuators are becoming embeddable and affordable, allowing us to manufacture myriads of computational devices and embed them in the world. Unfortunately, as computing becomes smaller and more plentiful, it becomes harder to make parts error free and calibrated. Furthermore, communication delays are becoming sizable, forcing devices to directly communicate with and directly affect only local neighbors. In short, the assumptions that data is both perfect and available are no longer true. Traditional engineering approaches do not apply to this computing class of cheap, distributed, possibly faulty, locally communicating devices, that we call “spatial computing”. We are forced to radically rethink our computing models, languages, and practices.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bankruptcy Prediction: Dynamic Geometric Genetic Programming (DGGP) Approach

 In this paper, a new Dynamic Geometric Genetic Programming (DGGP) technique is applied to empirical analysis of financial ratios and bankruptcy prediction. Financial ratios are indeed desirable for prediction of corporate bankruptcy and identification of firms’ impending failure for investors, creditors, borrowing firms, and governments. By the time, several methods have been attempted in...

متن کامل

Statement of Research

History has shown the benefits of high-level languages, language design, and managed language runtimes on how programmers develop complex and sophisticated systems. High-level languages, such as Java and Standard ML, are strongly typed and provide rich abstraction mechanisms, thereby reducing the time and effort to develop software. Language primitives and abstractions provide semantic guarante...

متن کامل

A dynamic programming approach for solving nonlinear knapsack problems

Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...

متن کامل

A Comparative Study of Two Whole-Program Slicers for C

Recently, a few whole-program static slicers for the C programming language have been developed, permitting a variety of hypotheses about time–precision tradeoffs in program analysis for software engineering to be tested. This paper reports an initial investigation into these claims through GrammaTech’s CodeSurfer and UCSD’s Sprite research prototype, which represent two two radically different...

متن کامل

A Compromise Decision-making Model for Multi-objective Large-scale Programming Problems with a Block Angular Structure under Uncertainty

This paper proposes a compromise model, based on the technique for order preference through similarity ideal solution (TOPSIS) methodology, to solve the multi-objective large-scale linear programming (MOLSLP) problems with block angular structure involving fuzzy parameters. The problem involves fuzzy parameters in the objective functions and constraints. This compromise programming method is ba...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012